Перевод: с английского на русский

с русского на английский

theorem-proving process

См. также в других словарях:

  • Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

  • Software development process — Activities and steps Requirements Specification …   Wikipedia

  • Deduction theorem — In mathematical logic, the deduction theorem is a metatheorem of first order logic.[1] It is a formalization of the common proof technique in which an implication A → B is proved by assuming A and then proving B from this assumption.… …   Wikipedia

  • Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

  • Pentagonal number theorem — In mathematics, the pentagonal number theorem, originally due to Euler, relates the product and series representations of the Euler function. It states that:prod {n=1}^infty (1 x^n)=sum {k= infty}^infty( 1)^kx^{k(3k 1)/2}.In other words, :(1 x)(1 …   Wikipedia

  • König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into …   Wikipedia

  • Clausius theorem — Thermodynamics …   Wikipedia

  • Stallings theorem about ends of groups — In the mathematical subject of group theory, the Stallings theorem about ends of groups states that a finitely generated group G has more than one end if and only if the group G admits a nontrivial decomposition as an amalgamated free product or… …   Wikipedia

  • Condorcet's jury theorem — is a political science theorem about the relative probability of a given group of individuals arriving at a correct decision. The theorem was first expressed by the Marquis de Condorcet in his 1785 work Essay on the Application of Analysis to the …   Wikipedia

  • First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

  • Discrete mathematics — For the mathematics journal, see Discrete Mathematics (journal). Graphs like this are among the objects studied by discrete mathematics, for their interesting mathematical properties, their usefulness as models of real world problems, and their… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»